On the Complexity of Generation in Ternary

In this paper, a follow-up of [1, 2], we continue to study ternary Hamming spaces Tn, where T = f0; 1; 2g, and their generators. In particular, we are interested in the computational complexity of the generation of all vectors with respect to a speci c generator G Tn. We consider several parameters, i.e., depth and load, which provide alternative ways to measure the computational e ort required in order to generate all points of Tn starting from those of G. We establish lower and upper bounds on the minimum depth and the minimum load for a generator in, and prove that some of them are sharp.